Time-Table Extended-Edge-Finding for the Cumulative Constraint
نویسندگان
چکیده
We propose a new filtering algorithm for the cumulative constraint. It applies the Edge-Finding, the Extended-Edge-Finding and the Time-Tabling rules in O(kn logn) where k is the number of distinct task heights. By a proper use of tasks decomposition, it enforces the Time-Tabling rule and the Time-Table Extended-Edge-Finding rule. Thus our algorithm improves upon the best known Extended-Edge-Finding propagator by a factor of O(logn) while achieving a much stronger filtering.
منابع مشابه
Explaining Time-Table-Edge-Finding Propagation for the Cumulative Resource Constraint
Cumulative resource constraints can model scarce resources in scheduling problems or a dimension in packing and cutting problems. In order to efficiently solve such problems with a constraint programming solver, it is important to have strong and fast propagators for cumulative resource constraints. Time-table-edge-finding propagators are a recent development in cumulative propagators, that com...
متن کاملTime-Table Disjunctive Reasoning for the Cumulative Constraint
Scheduling has been a successful domain of application for constraint programming since its beginnings. The cumulative constraint – which enforces the usage of a limited resource by several tasks – is one of the core components that are surely responsible of this success. Unfortunately, ensuring bound-consistency for the cumulative constraint is already NP-Hard. Therefore, several relaxations w...
متن کاملEdge Finding for Cumulative Scheduling
Edge-finding algorithms for cumulative scheduling are at the core of commercial constraint-based schedulers. This paper shows that Nuijten’s edge finder for cumulative scheduling, and its derivatives, are incomplete and use an invalid dominance rule. The paper then presents a new edgefinding algorithm for cumulative resources which runs in time O(nk), where n is the number of tasks and k the nu...
متن کاملTimetable Edge Finding Filtering Algorithm for Discrete Cumulative Resources
Edge Finding filtering algorithm is one of the reasons why Constraint Programming is a successful approach in the scheduling domain. However edge finding for cumulative resources was never as successful as edge finding for disjunctive resources. This paper presents a new variant of the edge finding algorithm which improves filtering by taking into account minimum capacity profile a data structu...
متن کاملAQuadratic Extended Edge-Finding Filtering Algorithm for Cumulative Resource Constraints∗
Edge-finding, extended edge-finding, not-first/not-last and energetic reasoning are well-known filtering rules used in constraint-based scheduling problems for propagating constraints over disjunctive and cumulative resources. In practice, these filtering algorithms frequently form part of a sequence to form a more powerful propagator, thereby helping to reduce search tree size. In this paper, ...
متن کامل